The acircuitic directed star arboricity of subcubic graphs is at most four
نویسندگان
چکیده
A directed star forest is a forest all of whose components are stars with arcs emanating from the center to the leaves. The acircuitic directed star arboricity of an oriented graph G (that is a digraph with no opposite arcs) is the minimum number of edge-disjoint directed star forests whose union covers all edges of G and such that the union of any two such forests is acircuitic. We show that every subcubic graph has acircuitic directed star arboricity at most four.
منابع مشابه
Acircuitic directed star arboricity of planar graphs with large girth
A directed star forest is a forest all of whose components are stars with arcs emanating from the center to the leaves. The acircuitic directed star arboricity of an oriented graph G is the minimum number of edge-disjoint directed star forests whose union covers all edges of G and such that the union of two such forests is acircuitic. We show that graphs with maximum average degree less than 7 ...
متن کاملOn incidence coloring and star arboricity of graphs
In this note we show that the concept of incidence coloring introduced in [BM] is a special case of directed star arboricity, introduced in [AA]. A conjecture in [BM] concerning asmyptotics of the incidence coloring number is solved in the negative following an example in [AA]. We generalize Theorem 2.1 of [AMR] concerning the star arboricity of graphs to the directed case by a slight modificat...
متن کاملPlanarization and Acyclic Colorings of Subcubic Claw-Free Graphs
We study methods of planarizing and acyclically coloring claw-free subcubic graphs. We give a polynomial-time algorithm that, given such a graph G, produces an independent set Q of at most n/6 vertices whose removal from G leaves an induced planar subgraph P (in fact, P has treewidth at most four). We further show the stronger result that in polynomial-time a set of at most n/6 edges can be ide...
متن کاملWDM and Directed Star Arboricity
A digraph is m-labelled if every arcs is labelled by an integer in {1, . . . , m}. Motivated by wavelength assignment for multicasts in optical star networks, we study n-fiber colourings of labelled digraph which are colourings of the arcs of D such that at each vertex v, for each colour in λ, in(v, λ) + out(v, λ) ≤ n with in(v, λ) the number of arcs coloured λ entering v and out(v, λ) the numb...
متن کاملCovering regular graphs with forests of small trees
A (d, k) -forest is a forest consisting of trees whose diameters are at most d and whose maximum vertex degree ,6. is at most k. The (d, k)-arboricity of a graph G is the minimum number of (d, k}-forests needed to cover E(G). This concept is a common generalization of linear k-arboricity and star arboricity. Using a probabilistic approach developed recently for linear karboricity, we obtain an ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 306 شماره
صفحات -
تاریخ انتشار 2006